Container Terminal Berth-Quay Crane Capacity Planning Based on Markov Chain
نویسندگان
چکیده
This paper constructs a berth-quay crane capacity planning model with the lowest average daily cost in container terminal, and analyzes influence of number berths quay cranes on terminal operation. The object is to optimize maximize benefits terminal. A steady state probability transfer based Markov chain for constructed by historical time series queuing process. current minimum operation principle (MTOP) strategy proposed correct transition due characteristics movement change service single berth. solution error reduced from 7.03% 0.65% compared theory without considering movement, which provides basis accurate model. validated two examples, results show that can greatly guide planning.
منابع مشابه
Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
In this work, we focus on the integrated planning of the following problems faced within the context of seaside operations at container terminals: berth allocation, quay crane assignment, and quay crane scheduling. First, we formulate a new binary integer linear program for the integrated solution of the berth allocation and quay crane assignment problems called BACAP. Then we extend it by inco...
متن کاملQuay Crane Allocation of Container Terminal Based on Cluster Analysis
Quay crane allocation is one of the most important scheduling plans in the container terminal. A large of production data is stored in the database of the terminal. This paper utilizes the method of data mining to analyze the problem of quay crane allocation by using these data. From the mining, valuable information has been gotten from the database. The paper chooses the fuzzy cmeans cluster a...
متن کاملOptimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
We focus on the integrated seaside operations in container terminals, namely the integration of berth allocation, quay crane assignment and quay crane scheduling problems. We first develope a mixed-integer linear programming formulation. Then, we propose an efficient cutting plane algorithm based on a decomposition scheme. Our approach deals with berthing positions of the vessels and their assi...
متن کاملThe Quay Crane Deployment Problem at a Maritime Container Terminal
Container unloading/loading at marine container terminals (MCTs) is a key logistic process, to which some research efforts have been addressed by using mathematical programming models formulated in a deterministic-static environment. Vice versa, DES models in a stochastic-dynamic environment are well capable of representing the entire process. Hence, simulation results to be an effective planni...
متن کاملOptimal berth allocation and time-invariant quay crane assignment in container terminals
Due to the dramatic increase in the world’s container traffic, the efficient management of operations in seaport container terminals has become a crucial issue. In this work, we focus on the integrated planning of the following problems faced at container terminals: berth allocation, quay crane assignment (number), and quay crane assignment (specific). First, we formulate a new binary integer l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Promet-traffic & Transportation
سال: 2021
ISSN: ['1848-4069', '0353-5320']
DOI: https://doi.org/10.7307/ptt.v33i2.3578